SuperMatching: Feature Matching Using Supersymmetric Geometric Constraints

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A general framework for image feature matching without geometric constraints

Computer vision applications that involve the matching of local image features frequently use Ratio– Match as introduced by Lowe and others, but is this really the optimal approach? We formalize the theoretical foundation of Ratio-Match and propose a general framework encompassing Ratio-Match and three other matching methods. Using this framework, we establish a theoretical performance ranking ...

متن کامل

Geometric constraints within feature hierarchies

We study the problem of enabling general 2D and 3D variational constraint representation to be used in conjunction with a feature hierarchy representation, where some of the features may use procedural or other non-constraint based representations. We trace the challenge to a requirement on constraint decomposition algorithms or decomposition-recombination (DR) planners used by most variational...

متن کامل

Using Geometric Constraints for Matching Disparate Stereo Views

Several vision tasks rely upon the availability of sets of corresponding features among images. This paper presents a method which, given some corresponding features in two stereo images, addresses the problem of matching them with .features extracted from a second stereo pair capturedfi-om a distant viewpoint. The proposed method is based on the assumption that the viewed scene contains two pl...

متن کامل

Robust Dense Matching Using Local and Global Geometric Constraints

A new robust dense matching algorithm is introduced in this paper: The algorithm starts from matching the most textured points, then a match propagation algorithm is developed with the best first strategy to densib the matches. Next, the matching map is regularised by using the local geometric constraints encoded by planar affine applications and by using the global geometric constraint encoded...

متن کامل

Matching Lines in Image Sequences using Geometric Constraints

An approach for tracking lines along temporal image sequences is presented. Three independent Kalman filters are used in the process, taking either Mahalanobis normalised distances or geometric constraints as measures of the matching degree.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Visualization and Computer Graphics

سال: 2013

ISSN: 1077-2626

DOI: 10.1109/tvcg.2013.15